Regarding polynomial approximation for ordinary differential equations
نویسندگان
چکیده
منابع مشابه
Computing with Polynomial Ordinary Differential Equations
In 1941, Claude Shannon introduced the General Purpose Analog Computer (GPAC) as a mathematical model of DiUerential Analysers, that is to say as a model of continuoustime analog (mechanical, and later on electronic) machines of that time. Following Shannon’s arguments, functions generated by the GPAC must satisfy a polynomial diUerential algebraic equation (DAE). As it is known that some compu...
متن کاملNewton Polygons of Polynomial Ordinary Differential Equations
In this paper we show some properties of the Newton polygon of a polynomial ordinary differential equation. We give the relation between the Newton polygons of a differential polynomial and its partial derivatives. Newton polygons of evaluations of differential polynomials are also described.
متن کاملPolynomial Chaos Expansions for Random Ordinary Differential Equations
We consider numerical methods for finding approximate solutions to Ordinary Differential Equations (ODEs) with parameters distributed with some probability by the Generalized Polynomial Chaos (GPC) approach. In particular, we consider those with forcing functions that have a random parameter in both the scalar and vector case. We then consider linear systems of ODEs with deterministic forcing a...
متن کاملA Stochastic Scheme of Approximation for Ordinary Differential Equations
In this note we provide a stochastic method for approximating solutions of ordinary differential equations. To this end, a stochastic variant of the Euler scheme is given by means of Markov chains. For an ordinary differential equation, these approximations are shown to satisfy a Large Number Law, and a Central Limit Theorem for the corresponding fluctuations about the solution of the different...
متن کاملConvergence rates for adaptive approximation of ordinary differential equations
This paper constructs an adaptive algorithm for ordinary differential equations and analyzes its asymptotic behavior as the error tolerance parameter tends to zero. An adaptive algorithm, based on the error indicators and successive subdivision of time steps, is proven to stop with the optimal number, N , of steps up to a problem independent factor defined in the algorithm. A version of the alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2008
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2007.07.001